Tunnel-MILP: Path Planning with Sequential Convex Polytopes∗

نویسندگان

  • Michael P. Vitus
  • Vijay Pradeep
  • Gabriel M. Hoffmann
  • Steven L. Waslander
  • Claire J. Tomlin
چکیده

This paper focuses on optimal path planning for vehicles in known environments. Previous work has presented mixed integer linear programming (MILP) formulations, which suffer from scalability issues as the number of obstacles, and hence the number of integer variables, increases. In order to address MILP scalability, a novel three-stage algorithm is presented which first computes a desirable path through the environment without considering dynamics, then generates a sequence of convex polytopes containing the desired path, and finally poses a MILP to identify a suitable dynamically feasible path. The sequence of polytopes form a safe tunnel through the environment, and integer decision variables are restricted to deciding when to enter and exit each region of the tunnel. Simulation results for this approach are presented and reveal a significant increase in the size and complexity of the environment that can be solved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear Time Varying MPC Based Path Planning of an Autonomous Vehicle via Convex Optimization

In this paper a new method is introduced for path planning of an autonomous vehicle. In this method, the environment is considered cluttered and with some uncertainty sources. Thus, the state of detected object should be estimated using an optimal filter. To do so, the state distribution is assumed Gaussian. Thus the state vector is estimated by a Kalman filter at each time step. The estimation...

متن کامل

On cardinality constrained cycle and path polytopes

Given a directed graph D = (N, A) and a sequence of positive integers 1 ≤ c1 < c2 < · · · < cm ≤ |N |, we consider those path and cycle polytopes that are defined as the convex hulls of simple paths and cycles of D of cardinality cp for some p ∈ {1, . . . , m}, respectively. We present integer characterizations of these polytopes by facet defining linear inequalities for which the separation pr...

متن کامل

Derivation of Contact States from Geometric Models of Objects

This technical report is an extended version of paper 19] with more application results. An eecient algorithm is presented to identify the topological contacts between two contacting polytopes from their geometric models. The algorithm extends the result of the polytope distance algorithm by Gilbert et. al 8] by exploring local topological information. For convex polytopes, the algorithm has a ...

متن کامل

Path Planning for UAVs Under Communication Constraints Using SPLAT! and MILP

We will in this paper address the problem of offline path planning for Unmanned Aerial Vehicles (UAVs). Our goal is to find paths that meet mission objectives, are safe with respect to collision and grounding, fuel efficient and satisfy criteria for communication. Due to the many nonconvex constraints of the problem, Mixed Integer Linear Programming (MILP) will be used in finding the path. Appr...

متن کامل

Tunnel Rehabilitation in Fault Zone Using Sequential Joints Method- Case Study: Karaj Water Conveyance Tunnel

The lining structure of Tunnel Boring Machine (TBM) excavated tunnels is composed of series of precast Reinforced Concrete (RC) pieces which are called segment. At the present paper, a novel method is introduced for seismic retrofitting of segmental tunnels located at active fault zones in rock environment with case study of Amirkabir dam to Tehran water transfer tunnel (Karadj tunnel). The mai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008